/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: Jiang Jinxi
 * Date: 2024-04-16
 * Time: 9:16
 */
public class HashBuck2 <K,V>{
    static class Node<K,V>{
        public K key;
        public V val;
        public Node<K,V> next;

        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }
    public Node<K,V>[] array = new Node[10];
    public int usedSize;
    public static final double LOAD_FACTOR = 0.75;

    public void push(K key,V val){
        Node<K,V> node = new Node<>(key,val);
        int hashCode = key.hashCode();
        int index = hashCode % array.length;
        Node cur = array[index];
        while(cur != null){
            if(cur.key.equals(key)){
                cur.val = val;
                return;
            }
            cur = cur.next;
        }
        node.next = array[index];
        array[index] = node;

        usedSize++;

    }
}
